Edge Detection Using Cellular Automata
نویسندگان
چکیده
Edge detection has been a long standing topic in image processing, generating hundreds of papers and algorithms over the last 50 years. Likewise, the topic has had a fascination for researchers in cellular automata, who have also developed a variety of solutions, particularly over the last ten years. CA based edge detection has potential benefits over traditional approaches since it is computationally efficient, and can be tuned for specific applications by appropriate selection or learning of rules. This chapter will provide an overview of CA based edge detection techniques, and assess their relative merits and weaknesses. Several CA based edge detection methods are implemented and tested to enable an initial comparison between competing approaches.
منابع مشابه
Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملCombining Cellular Automata and Particle Swarm Optimization for Edge Detection
Cellular Automata can be successfully applied in image processing. In this paper, we propose a new edge detection algorithm, based on cellular automata to extract edges of different types of images, using a totalistic transition rule. The metaheuristic PSO is used to find out the optimal and appropriate transition rules set of cellular automata for edge detection task. This combination increase...
متن کاملA Novel Method of Edge Detection using Cellular Automata
Edge detection is one of the most commonly used operations in image analysis. Several edge detectors have been proposed in literature for enhancing and detecting of edges. In this paper a new and optimal approach of edge detection based on Cellular Automata (CA) has been proposed. The idea is simple but effective technique for edge detection that greatly improves the performances of complicated...
متن کاملAn edge detection method using outer Totalistic Cellular Automata
A number of Cellular Automata (CA)-based edge detectors have been developed recently due to the simplicity of the model and the potential for simultaneous removal of different types of noise in the process of detection. This paper introduced a novel edge detector using Outer Totalistic Cellular Automata. Its performance has been compared with other recently developed CA-based edge detectors, in...
متن کامل